Description: 基于matlab的模拟退火算法求解旅行商问题的实现。简单 方便 好用，解压后就可使用-Matlab simulated annealing algorithm based on traveling salesman problem implementation. Simple easy to use, can use after decompression Platform: |
Size: 479232 |
Author:徐小夏 |
Hits:
Description: 基于.net的模拟退火算法求解旅行商问题的实现。简单，方便，实用。解压后就可以用。-Based. Net simulated annealing algorithm traveling salesman problem implementation. Simple, convenient and practical. After decompression can be used. Platform: |
Size: 27648 |
Author:徐小夏 |
Hits:
Description: 基于MATLAB 使用模拟退火算法求解旅行商问题的源码实现。解压后就可以用。-MATLAB based simulated annealing algorithm using the source code for the traveling salesman problem implementation. After decompression can be used. Platform: |
Size: 4096 |
Author:徐小夏 |
Hits:
Description: 基于C# 使用模拟退火算法求解旅行商问题的源码实现，解压后就可使用，方便 好用。-Based on C# using the simulated annealing algorithm for traveling salesman problem source implementation, after decompression can be used, easy to use. Platform: |
Size: 17408 |
Author:徐小夏 |
Hits:
Description: 基于C++的模拟退火算法求解旅行商问题的源码实现过程。解压后即可使用。一起分享。-C++ based on simulated annealing algorithm for solving the traveling salesman problem source implementation process. After decompression can be used. Share. Platform: |
Size: 74752 |
Author:徐小夏 |
Hits:
Description: 模拟退火（SA）、遗传算法（GA）、粒子群优化（PSO）解决旅行商问题（TSP）实验
本文件包括源码，实验说明文档，实验总结PPT
Have a happy experiment！-Simulated annealing (SA), genetic algorithms (GA), particle swarm optimization (PSO) to solve the traveling salesman problem (TSP) experiment of this document, including source code, test documentation, test summary PPT Have a happy experiment! Platform: |
Size: 348160 |
Author:pu |
Hits:
Description: 模拟退火算法求解旅行商问题，所用数据时CHN1-Simulated Annealing for Traveling Salesman problem, the use of data CHN144 Platform: |
Size: 331776 |
Author:吴小英 |
Hits:
Description: Use Simulated annealing to solve Traveling salesman problem by C-Use Simulated annealing to solve Traveling salesman problem by C++ Platform: |
Size: 95232 |
Author:林谷謙 |
Hits:
Description: 模拟退火解决旅行商问题，我调过了可用,初学者大家来试试，下载啊，很好用-Simulated annealing to solve the traveling salesman problem, I transferred over the available Platform: |
Size: 12288 |
Author:李娟 |
Hits:
Description: 旅行商问题是一个典型的NP完全性问题。本文基于改进的自适应遗传
算法设计并开发了一个求解旅行商问题的软件程序，并将此程序进行了48
个城市的TSP问题计算，与模拟退火算法的计算过程及计算结果进行了比
较。文中给出了遗传算法在解决TSP问题中的参数选择和编码方式、适应
度函数的设计、种群的初始化和遗传算子的详细设计。通过对此程序的改
装，即可用于其他NP完全性问题的求解。-The traveling salesman problem is a typical NP problem.This paper
implements a program to resolve the TSP problem according to the improved
Genetic Algorithm,and calculate a TSP problem of 48 cites.Comparing the
calculation result of GA program and Simulated Annealing Algorithm.This
paper describes the parameters selection and the coding method,fitness
function design,population’s initialization and genetic operators’design in
the program of resolving the TSP using the improved genetic algorithm.
The result proves that the improved GA program excels the SA program.
The improved GA program can get the satisfied result in a short time.
Platform: |
Size: 5256192 |
Author:翁經堯 |
Hits:
Description: 这是一个用退火算法来求解货郎担问题的matlab优化程序-This is a annealing algorithm to solve the traveling salesman problem matlab optimizer Platform: |
Size: 2048 |
Author:wanwgei |
Hits:
Description: Solution for Travelling Salesman Problem using the simulated annealing heuristic.
As an input, we take coordinates of cities (x,y) and then transform them into distances matrix (we assume, the distance between x and y is the same as between y and x). All the computations then are performed on such matrix.
The output is the shortest path between all cities, the algorithm was capable to find.-Solution for Travelling Salesman Problem using the simulated annealing heuristic.
As an input, we take coordinates of cities (x,y) and then transform them into distances matrix (we assume, the distance between x and y is the same as between y and x). All the computations then are performed on such matrix.
The output is the shortest path between all cities, the algorithm was capable to find. Platform: |
Size: 111616 |
Author:Fenomen |
Hits:
Description: 模拟退火算法求解旅行商问题
程序使用的参数说明：初始温度的选取方法：取一个确定值：280度
状态被接受的条件：如果delta f < 0, 则At = 1，否则At = exp(-delta f / t)
降温算法：采用等比例下降的方法，比例系数为0.95
同一温度内计算结束的条件： 在每个温度下采用固定的迭代次数，Lk=100n，n为城市数；
算法结束条件：
当相邻三个温度得到的解无任何变化时算法停止。
-Simulated annealing algorithm for solving traveling salesman problem
Procedures for the use of the parameters: initial temperature selection method: take a determined value: 280 degrees
The state accepted the condition: if delta f < 0, At = 1, if At = exp (- delta f/T )
Cooling algorithm: the proportion of dropping method, the proportion coefficient is 0.95
The same temperature calculation of end conditions: at each temperature using a fixed number of iterations, Lk = 100N, n city number
Algorithm of end conditions:
When three adjacent temperature of the solution without any changes in the algorithm to stop. Platform: |
Size: 2048 |
Author:朱茵茵 |
Hits:
Description: 用模拟退火算法解决经典的旅行商问题，有数据，有程序，有解决问题前后的图形对照。有已经过调试。-Simulated annealing algorithm to solve the classical traveling salesman problem, data, procedures, and solve problems before and after the graphics control. Has been debugged. Platform: |
Size: 1024 |
Author:program_c |
Hits:
Description: 求模拟退火算法解旅行商问题,求解最优路径，为用户计算得到最经济的路线，一遍做决策。-Solving Traveling Salesman Problem seeking the simulated annealing algorithm for solving the optimal path, calculate the most economic route for the user, again to make decisions. Platform: |
Size: 1024 |
Author:Li Nan |
Hits:
Description: 模拟退火算法解决旅行商问题的的C++代码-Simulated annealing algorithm to solve the traveling salesman problem C++ code Platform: |
Size: 1024 |
Author:王红 |
Hits:
Search - salesman annealing